Random graph models for dynamic networks
نویسندگان
چکیده
منابع مشابه
Random graph models for dynamic networks
We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. In addition to computing equilibrium...
متن کاملExponential random graph models for multilevel networks
Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been accompanied by impressive theoretical development (e.g. Kozlowski and Klein, 2000) and sophisticated methodology (e.g. Snijders and Bosker, 2012). But typically the approach assumes that links between groups are non-existent, and interdependence among the individuals derives so...
متن کاملRandom graph models for wireless communication networks
This thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802.11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver. Each device may only communicate with other devices within its transmission range. We use graph models for the relationship between any two devices: a node stands for a device, and an ed...
متن کاملExponential random graph models for affiliation networks
Statistical modeling of social networks as complex systems has always been and remains a challenge for social scientists. Exponential family models give us a convenient way of expressing local network structures that have sufficient statistics for their corresponding parameters. This kind of model, known as Exponential Random Graph Models (ERGMs), or p∗ models, have been developed since the 198...
متن کاملRandom Graph Models for Networks 1.1 Graph Modeling
1.2 Erdős-Renyi Model The above approach constitutes the sampling view of generating a random graph. Alternatively we can take a constructive view where we start with vertex set V = {1, 2, 3....n}, and selecting uniformly at random one edge from those edges not yet chosen, repeating this m times. Definition 3 G(n, p) is the random graph obtained by starting with vertex set V = {1, 2, 3...n}, le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2017
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2017-80122-8